Combinatorial Statistics on Alternating Permutations

نویسنده

  • SERGE DULUCQ
چکیده

We consider two combinatorial statistics on permutations. One is the genus. The other, d̂es, is defined for alternating permutations, as the sum of the number of descents in the subwords formed by the peaks and the valleys. We investigate the distribution of d̂es on genus zero permutations and Baxter permutations. Our qenumerative results relate the d̂es statistic to lattice path enumeration, the rank generating function and characteristic polynomial of noncrossing partition lattices, and polytopes obtained as face-figures of the associahedron.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Increasing trees and alternating permutations

In this article we consider some increasing trees, the number of which is equal to the number of alternating (updown) permutations, that is, permutations of the form σ(1) < σ(2) > σ(3) < ... . It turns out that there are several such classes of increasing trees, each of which is interesting in itself. Special attention is paid to the study of various statistics on these trees, connected with th...

متن کامل

A combinatorial proof for the enumeration of alternating permutations with given peak set

Using the correspondence between alternating permutations and pairs of matchings, we present a combinatorial proof for the enumeration of alternating permutations with given peak set. Moreover, we give a refinement according to the number of left to right maxima.

متن کامل

Combinatorial study on the group of parity alternating permutations

The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian numbers have intimate relationships to the set.

متن کامل

A Combinatorial Proof for the Alternating Convolution of the Central Binomial Coefficients

We give a combinatorial proof of the identity for the alternating convolution of the central binomial coefficients. Our proof entails applying an involution to certain colored permutations and showing that only permutations containing cycles of even length remain. The combinatorial identity

متن کامل

Combinatorics in the group of parity alternating permutations

We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998